A High-Performance Reconfigurable Elliptic Curve Processor for GF (2)

نویسندگان

  • Gerardo Orlando
  • Christof Paar
چکیده

This work proposes a processor architecture for elliptic curves cryptosystems over fields GF (2). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bitparallel squarer, a digit-serial multiplier, and two programmable processors. Through reconfiguration, the squarer and the multiplier architectures can be optimized for any field order or field polynomial. The multiplier performance can also be scaled according to system’s needs. Our results show that implementations of this architecture executing the projective coordinates version of the Montgomery scalar multiplication algorithm can compute elliptic curve scalar multiplications with arbitrary points in 0.21 msec in the field GF (2). A result that is at least 19 times faster than documented hardware implementations and at least 37 times faster than documented software implementations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)

This work proposes a processor architecture for elliptic curves cryptosystems over fields GF (2 m). This is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curves and finite fields. The main features of this architecture are the use of an optimized bit-parallel squarer, a digit-serial...

متن کامل

An reconfigurable multiplier in GF(2m) for elliptic curve cryptosystem

In this paper an efficient architecture of a reconfigurable bit-serial polynomial hasis multiplier for Galois field GF(Z”’), where I<m= is proposed. The value of the field degree m can be changed and the irreducible polynomial can be configured and programmed. Comparing with previous designs, the advantages of.the proposed architecture are (i) the high order of flexibility, which allows an easy...

متن کامل

High radix parallel architecture for GF(p) elliptic curve processor

A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better improved performance than...

متن کامل

A reconfigurable processor for high speed point multiplication in elliptic curves

This paper presents a generic architecture for the computation of elliptic curve scalar multiplication over binary extension fields. In order to optimize the performance as much as we could, we designed a parallelized version of the well-known Montgomery point multiplication algorithm implemented on a reconfigurable hardware platform (Xilinx XCV3200). The proposed architecture allows the comput...

متن کامل

A High Speed, Optimized Multiplier Architecture for a DF-ECC Processor

This paper presents a High speed, optimized multiplier architecture for a dual-field (DF) processor for elliptic curve cryptography (ECC). This processor can support the required operations in both galois prime field GF(p) and binary field GF(2). The performance of the processor is enhanced by the judicious selection of proper type of coordinates in the arithmetic unit. The arithmetic unit is d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000